Relaxation Time and the Problem of the Pleistocene
نویسنده
چکیده
Although changes in habitat area, driven by changes in sea level, have long been considered as a possible cause of marine diversity change in the Phanerozoic, the lack of Pleistocene extinction in the Californian Province has raised doubts, given the large and rapid sea-level changes during the Pleistocene. Neutral models of metacommunities presented here suggest that diversity responds rapidly to changes in habitat area, with relaxation times of a few hundred to a few thousand years. Relaxation time is controlled partly by metacommunity size, implying that different provinces or trophic levels might have measurably different responses to changes in habitable area. Geologically short relaxation times imply that metacommunities should be able to stay nearly in equilibrium with all but the most rapid changes in area. A simulation of the Californian Province during the Pleistocene confirms this, with the longest lags in diversity approaching 20 kyr. The apparent lack of Pleistocene extinction in the Californian Province likely results from the difficulty of sampling rare species, coupled with repopulation from adjacent deep-water or warm-water regions.
منابع مشابه
The Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA Lagrangian Relaxation-based Algorithm to Solve a Home Health Care Routing Problem
Nowadays, a rapid growth in the rate of life expectancy can be seen especially in the developed countries. Accordingly, the population of elderlies has been increased. By another point of view, the number of hospitals, retirement homes along with medical staffs has not been grown with a same rate. Hence, Home Health Care (HHC) operations including a set of nurses and patients have been develope...
متن کاملLagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملBuoyancy Term Evolution in the Multi Relaxation Time Model of Lattice Boltzmann Method with Variable Thermal Conductivity Using a Modified Set of Boundary Conditions
During the last few years, a number of numerical boundary condition schemes have been used to study various aspects of the no-slip wall condition using the lattice Boltzmann method. In this paper, a modified boundary condition method is employed to simulate the no-slip wall condition in the presence of the body force term near the wall. These conditions are based on the idea of the bounce-back ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013